Toward deterministic compressed sensing
نویسندگان
چکیده
منابع مشابه
Toward deterministic compressed sensing.
Over the past decade, compressed sensing has delivered significant advances in the theory and application of measuring and compressing data. Consider capturing a 10 mega pixel image with a digital camera. Emailing an image of this size requires an unnecessary amount of storage space and bandwidth. Instead, users employ a standard digital compression scheme, such as JPEG, to represent the image ...
متن کاملDeterministic constructions of compressed sensing matrices
Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performance of compressed sensing on signal classes is directly related to Gelfand widths. Similar to the deeper constructions of optimal subspaces in Gelfand widths, most sampling algorithms are based on randomization. However...
متن کاملChirp Sensing Codes: Deterministic Compressed Sensing Measurements for Fast Recovery
Compressed sensing is a novel technique to acquire sparse signals with few measurements. Normally, compressed sensing uses random projections as measurements. Here we design deterministic measurements and an algorithm to accomplish signal recovery with computational efficiently. A measurement matrix is designed with chirp sequences forming the columns. Chirps are used since an efficient method ...
متن کاملCompressed Sensing of Memoryless Sources: A Deterministic Hadamard Construction
Compressed sensing is a new trend in signal processing for efficient data sampling and signal acquisition. The idea is that most real-world signals have a sparse representation in an appropriate basis and this can be exploited to capture the sparse signal by taking a few linear projections. The recovery is possible by running appropriate low-complexity algorithms that exploit the sparsity (prio...
متن کاملDeterministic Bounds for Restricted Isometry of Compressed Sensing Matrices
Compressed Sensing (CS) is an emerging field that enables reconstruction of a sparse signal x ∈ Rn that has only k ≪ n non-zero coefficients from a small number m ≪ n of linear projections. The projections are obtained by multiplying x by a matrix Φ ∈ R — called a CS matrix — where k < m ≪ n. In this work, we ask the following question: given the triplet {k,m, n} that defines the CS problem siz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2013
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1221228110